/*
package NiuKe;

import java.util.Arrays;
import java.util.Scanner;

*/
/**
 * @Description:
 * @Author: Hanzao
 * @Date: 2022/06/14/8:23
 *//*

public class HJ35 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int num = scanner.nextInt();
        if(num == 1){
            System.out.println(1);
        }else if(num == 2){
            System.out.println("1 3");
            System.out.println("2");
        }else{
            int[][] arr = new int[num][num];
            arr[0][0] = 1;
            int tmp = 2;
            */
/* 第一行 *//*

            for(int i=1;i<num;i++,tmp++){
                arr[0][i] = arr[0][i-1] + tmp;
            }
            */
/* 第二行开始*//*

            int hang = num-1; //4
            int lie = num-1; //4
            for(int i=1;i<=hang;i++){
                tmp = i;
                for(int j=0;j<num;j++){
                    arr[i][j] = arr[i-1][j] + tmp;
                    tmp++;
                }
            }
            */
/* 输出 *//*

            tmp = num;
            for(int i=0;i<num;i++,tmp--){
                for(int j=0;j<tmp;j++){
                    System.out.print(arr[i][j]+" ");
                }
                System.out.println(" ");
            }
        }
    }
}
*/
